iSTART 2: Improvements for efficiency and effectiveness
نویسندگان
چکیده
منابع مشابه
“It’s Not Dead Yet!” - MPEG-2 Video Coding Efficiency Improvements
Learn about significant new improvements to MPEG-2 Video coding, how this enables more services to legacy set-top boxes and receivers, and about the revolutionary new TANDBERG EN8100 Advanced MPEG-2 Broadcast Encoder. ABSTRACT Broadcasters are required by federal regulation, and locked into in practice due to the millions of consumer digital televisions (DTVs) purchased, to use the MPEG-2 Video...
متن کاملPower Efficiency Improvements for Wireless Transmissions
To my parents, and my wife Lin Sun. iii ACKNOWLEDGEMENTS I would like to express my gratitude to all whose direct and indirect support helped me complete my thesis. First, I would like to thank my advisor, Prof. G. Tong Zhou who has continuously supported my work and ideas throughout my studies at Georgia Institute of Technology. I appreciate her close guidance and great efforts to prepare me t...
متن کاملComputational efficiency improvements for image colorization
We propose an efficient algorithm for colorization of greyscale images. As in prior work, colorization is posed as an optimization problem: a user specifies the color for a few scribbles drawn on the greyscale image and the color image is obtained by propagating color information from the scribbles to surrounding regions, while maximizing the local smoothness of colors. In this formulation, col...
متن کاملEfficiency Improvements for Two-party Secure Computation
We optimize the communication (and, indirectly, computation) complexity of two-party secure function evaluation (SFE). We propose a new approach, which relies on the information-theoretic (IT) Garbled Circuit (GC), which is more efficient than Yao’s GC on shallow circuits. When evaluating a large circuit, we “slice” it into thin layers and evaluate them with IT GC. Motivated by the client-serve...
متن کاملEfficiency Improvements for Parallel Subgraph Miners
Algorithms for finding frequent and/or interesting subgraphs in a single large graph scenario are computationally intensive because of the graph isomorphism and the subgraph isomorphism problem. These problems are compounded by the size of most real-world datasets which have sizes in the order of 10 or 10. The SUBDUE algorithm developed by Cook and Holder finds the most compressing subgraph in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods
سال: 2007
ISSN: 1554-351X,1554-3528
DOI: 10.3758/bf03193151